Time-Dependent Alternative Route Planning

We present a new method for computing a set of alternative origin-to-destination routes in road networks with an underlying time-dependent metric. The resulting set is aggregated in the form of a time-dependent alternative graph and is characterized by minimum route overlap, small stretch factor, small size and low complexity. To our knowledge, this is the first work that deals with the time-dependent setting in the framework of alternative routes. Based on preprocessed minimum travel-time information between a small set of nodes and all other nodes in the graph, our algorithm carries out a collection phase for candidate alternative routes, followed by a pruning phase that cautiously discards uninteresting or low-quality routes from the candidate set. Our experimental evaluation on real time-dependent road networks demonstrates that the new algorithm performs much better (by one or two orders of magnitude) than existing baseline approaches. In particular, the entire alternative graph can be computed in less than 0.384sec for the road network of Germany, and in less than 1.24sec for that of Europe. Our approach provides also "quick-and-dirty" results of decent quality, in about 1/300 of the above mentioned query times for continental-size instances

REX: A Realistic Time-Dependent Model for Multimodal Public Transport

We present the non-FIFO time-dependent graph model with REalistic vehicle eXchange times (REX) for schedule-based multimodal public transport, along with a novel query algorithm called TRIP-based LAbel-correction propagation (TRIPLA) algorithm that efficiently solves the realistic earliest-arrival routing problem. The REX model possesses all strong features of previous time-dependent graph models without suffering from their deficiencies. It handles non-negligible exchanges from one vehicle to another, as well as supports non-FIFO instances which are typical in public transport, without compromising space efficiency. We conduct a thorough experimental evaluation with real-world data which demonstrates that TRIPLA significantly outperforms all state-of-the-art query algorithms for multimodal earliest-arrival routing in schedule-based public transport

Improved Oracles for Time-Dependent Road Networks

A novel landmark-based oracle (CFLAT) is presented, which provides earliest-arrival-time route plans in time-dependent road networks. To our knowledge, this is the first oracle that preprocesses combinatorial structures (collections of time-stamped min-travel-time-path trees) rather than travel-time functions. The preprocessed data structure is exploited by a new query algorithm (CFCA) which also computes (and pays for it) the actual connecting path that preserves the theoretical approximation guarantees. To make it practical and tackle the main burden of landmark-based oracles (the large preprocessing requirements), CFLAT is extensively engineered. A thorough experimental evaluation on two real-world benchmark instances shows that CFLAT achieves a significant improvement on preprocessing, approximation guarantees and query-times, in comparison to previous landmark-based oracles. It also achieves competitive query-time performance compared to state-of-art speedup heuristics for time-dependent road networks, whose query-times in most cases do not account for path construction

Engineering Graph-Based Models for Dynamic Timetable Information Systems

Many efforts have been done in the last years to model public transport timetables in order to find optimal routes. The proposed models can be classified into two types: those representing the timetable as an array, and those representing it as a graph. The array-based models have been shown to be very effective in terms of query time, while the graph-based models usually answer queries by computing shortest paths, and hence they are suitable to be used in combination with speed-up techniques developed for road networks. In this paper, we focus on the dynamic behavior of graph-based models considering the case where transportation systems are subject to delays with respect to the given timetable. We make three contributions: (i) we give a simplified and optimized update routine for the well-known time-expanded model along with an engineered query algorithm; (ii) we propose a new graph-based model tailored for handling dynamic updates; (iii) we assess the effectiveness of the proposed models and algorithms by an experimental study, which shows that both models require negligible update time and a query time which is comparable to that required by some array-based models

Playing and Listening to Tailor-Made Notched Music: Cortical Plasticity Induced by Unimodal and Multimodal Training in Tinnitus Patients

Background. The generation and maintenance of tinnitus are assumed to be based on maladaptive functional cortical reorganization. Listening to modified music, which contains no energy in the range of the individual tinnitus frequency, can inhibit the corresponding neuronal activity in the auditory cortex. Music making has been shown to be a powerful stimulator for brain plasticity, inducing changes in multiple sensory systems. Using magnetoencephalographic (MEG) and behavioral measurements we evaluated the cortical plasticity effects of two months of (a) active listening to (unisensory) versus (b) learning to play (multisensory) tailor-made notched music in nonmusician tinnitus patients. Taking into account the fact that uni- and multisensory trainings induce different patterns of cortical plasticity we hypothesized that these two protocols will have different affects. Results. Only the active listening (unisensory) group showed significant reduction of tinnitus related activity of the middle temporal cortex and an increase in the activity of a tinnitus-coping related posterior parietal area. Conclusions. These findings indicate that active listening to tailor-made notched music induces greater neuroplastic changes in the maladaptively reorganized cortical network of tinnitus patients while additional integration of other sensory modalities during training reduces these neuroplastic effects

Neuroplastic Effects of Combined Computerized Physical and Cognitive Training in Elderly Individuals at Risk for Dementia: An eLORETA Controlled Study on Resting States

The present study investigates whether a combined cognitive and physical training may induce changes in the cortical activity as measured via electroencephalogram (EEG) and whether this change may index a deceleration of pathological processes of brain aging. Seventy seniors meeting the clinical criteria of mild cognitive impairment (MCI) were equally divided into 5 groups: 3 experimental groups engaged in eight-week cognitive and/or physical training and 2 control groups: active and passive. A 5-minute long resting state EEG was measured before and after the intervention. Cortical EEG sources were modelled by exact low resolution brain electromagnetic tomography (eLORETA). Cognitive function was assessed before and after intervention using a battery of neuropsychological tests including the minimental state examination (MMSE). A significant training effect was identified only after the combined training scheme: a decrease in the post-compared to pre-training activity of precuneus/posterior cingulate cortex in delta, theta, and beta bands. This effect was correlated to improvements in cognitive capacity as evaluated by MMSE scores. Our results indicate that combined physical and cognitive training shows indices of a positive neuroplastic effect in MCI patients and that EEG may serve as a potential index of gains versus cognitive declines and neurodegeneration. This trial is registered with ClinicalTrials.gov Identifier NCT02313935

Reducing the environmental impact of surgery on a global scale: systematic review and co-prioritization with healthcare workers in 132 countries

Abstract Background Healthcare cannot achieve net-zero carbon without addressing operating theatres. The aim of this study was to prioritize feasible interventions to reduce the environmental impact of operating theatres. Methods This study adopted a four-phase Delphi consensus co-prioritization methodology. In phase 1, a systematic review of published interventions and global consultation of perioperative healthcare professionals were used to longlist interventions. In phase 2, iterative thematic analysis consolidated comparable interventions into a shortlist. In phase 3, the shortlist was co-prioritized based on patient and clinician views on acceptability, feasibility, and safety. In phase 4, ranked lists of interventions were presented by their relevance to high-income countries and low–middle-income countries. Results In phase 1, 43 interventions were identified, which had low uptake in practice according to 3042 professionals globally. In phase 2, a shortlist of 15 intervention domains was generated. In phase 3, interventions were deemed acceptable for more than 90 per cent of patients except for reducing general anaesthesia (84 per cent) and re-sterilization of ‘single-use’ consumables (86 per cent). In phase 4, the top three shortlisted interventions for high-income countries were: introducing recycling; reducing use of anaesthetic gases; and appropriate clinical waste processing. In phase 4, the top three shortlisted interventions for low–middle-income countries were: introducing reusable surgical devices; reducing use of consumables; and reducing the use of general anaesthesia. Conclusion This is a step toward environmentally sustainable operating environments with actionable interventions applicable to both high– and low–middle–income countries

Improved Alternative Route Planning ∗

We present improved methods for computing a set of alternative source-to-destination routes in road networks in the form of an alternative graph. The resulting alternative graphs are characterized by minimum path overlap, small stretch factor, as well as low size and complexity. Our approach improves upon a previous one by introducing a new pruning stage preceding any other heuristic method and by introducing a new filtering and fine-tuning of two existing methods. Our accompanying experimental study shows that the entire alternative graph can be computed pretty fast even in continental size networks